Temporalized logics and automata for time granularity
نویسندگان
چکیده
منابع مشابه
Temporalized logics and automata for time granularity
The ability of providing and relating temporal representations at different ‘grain levels’ of the same reality is an important research theme in computer science and a major requirement for many applications, including formal specification and verification, temporal databases, data mining, problem solving, and natural language understanding. In particular, the addition of a granularity dimensio...
متن کاملParity Automata for Quantitative Linear Time Logics
We initiate a study of automata-based model checking for previously proposed quantitative linear time logics interpreted over coalgebras. Our results include: (i) an automata-theoretic characterisation of the semantics of these logics, based on a notion of extent of a quantitative parity automaton, (ii) a study of the expressive power of Büchi variants of such automata, with implications on the...
متن کاملA combined approach to temporal logics for time granularity
The ability of providing and relating temporal representations at different ‘grain levels’ of the same reality is an important research theme in Computer Science and Artificial Intelligence and a major requirement for many applications, including formal specifications, temporal databases, data mining, problem solving, and natural language understanding. In particular, the addition of a granular...
متن کاملPSPACE Automata for Description Logics
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this result can be improved, and we define two classes of automata, called segmentable and weakly-segmentable, for which emptiness can be decided using space logarithmic in the size of the automaton (and thus polynomial in ...
متن کاملLogics and Automata for Totally Ordered Trees
A totally ordered tree is a tree equipped with an additional total order on its nodes. It provides a formal model for data that comes with both a hierarchical and a sequential structure; one example for such data are natural language sentences, where a sequential structure is given by word order, and a hierarchical structure is given by grammatical relations between words. In this paper, we stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2004
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s147106840400208x